A Parallel Genetic Algorithm Framework for Transportation Planning and Logistics Management
نویسندگان
چکیده
منابع مشابه
Ai Planning for Transportation Logistics
In the last decade the efficiency of the Artificial Intelligence Planning Systems has been increased significantly. New systems appeared that are able to cope with planning problems being orders of magnitude more complex than the ones solvable in early 90's. This vast improvement increase was made possible mainly by three new approaches in plan generation: planning graphs, satisfiability planni...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملFreight Transportation Planning and Logistics
A well-functioning freight transportation system is an essential element in any successful economy. However, at the beginning of the new millennium, the prediction is that the demand for goods movement will outstrip the rate of improvements to the physical infrastructure. Marked growth in time-sensitive freight markets will tax demands on a system that already is operating near capacity in some...
متن کاملGlobal Logistics Road Planning: A Genetic Algorithm Approach
Logistics transportation between two countries presents some special challenges and issues for business organizations, because of the cost differentials between two countries regarding transporting, staffing, warehousing, etc. In this study, we consider a logistics problem experienced by a producer of electrical equipment, which needs to transport their products, which are produced in Mainland ...
متن کاملWorkforce Planning with a Parallel Genetic Algorithm
A workforce planning problem is formulated here as a mixed-integer program and then solved with Cplex. Our experiments show that Cplex is capable of solving to optimality of near optimality small “structured” problem instances but it fails to solve those considered “unstructured”. We describe the development of a parallel genetic algorithm capable of finding high-quality solutions to both struc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2997812